Quasigraphs and skeletal partitions

نویسندگان

چکیده

We give a new proof of the Skeletal Lemma, which is main technical tool in our paper on Hamilton cycles line graphs (Kaiser and Vrána, 2012). It generalises results disjoint spanning trees to context 3-hypergraphs. The lemma proved slightly stronger version that more suitable for applications. simplified formulated accessible way.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotone partitions and almost partitions

Article history: Received 28 April 2014 Received in revised form 14 October 2014 Accepted 14 October 2014 Available online 31 October 2014 MSC: 54D20

متن کامل

Equitable Partitions and Orbit Partitions

We consider two kinds of partition of a graph, namely orbit partitions and equitable partitions. Although an orbit partition is always an equitable partition, the converse is not true in general. We look at some classes of graphs for which the converse is true.

متن کامل

k-Efficient partitions of graphs

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

متن کامل

Upper Estimates of the Volume Density for Minimal Quasigraphs

Our main result states that if M is a properly immersed minimal hypersurface with compact boundary and the multiplicity of projection of M on a hyperplane does not exceed s ∈ Z then M has quadratic volume growth and Θn(M) ≤ sκn, where Θn(M) is the volume density at infinity and κn ∼ √ πn/8 as n → ∞. This implies that any entire n-dimensional minimal graph must contain a ‘massive’ part lying in ...

متن کامل

Partitions, Rational Partitions, and Characterization of Complexity

Abstra ct. Th e quantitat ive characterizat ion of complexity for several dynami c processes is approached by a mathematical scheme based on th e met ric and combinatori al prop ert ies of the space Z of finite measur able par titions . Precisely, Z is embed ded in a larger spa ce R of new objects, "rational part it ions," describin g the anti similarity between two prob abilistic experiments ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2023

ISSN: ['1095-9971', '0195-6698']

DOI: https://doi.org/10.1016/j.ejc.2022.103563